Vertical Decomposition of a Lattice Using Clique Separators
نویسندگان
چکیده
A concept (or Galois) lattice is built on a binary relation; this relation can be represented by a bipartite graph. We explain how we can use the graph tool of clique minimal separator decomposition to decompose some bipartite graphs into subgraphs in linear time; each subgraph corresponds to a subrelation. We show that the lattices of these subrelations easily yield the lattice of the global relation. We also illustrate how this decomposition is a tool to help displaying the lattice.
منابع مشابه
Décomposition par séparateurs minimaux complets et applications
We worked on clique minimal separator decomposition. In order to compute this decomposition on a graph G we need to compute the minimal separators of its triangulation H. In this context, the first efforts were on finding a clique minimal separators in a chordal graph. We defined a structure called atom tree inspired from the clique tree to compute and represent the final products of the decomp...
متن کاملOrganizing the atoms of the clique separator decomposition into an atom tree
We define an atom tree of a graph as a generalization of a clique tree: its nodes are the atoms obtained by clique minimal separator decomposition, and its edges correspond to the clique minimal separators of the
متن کاملClique-decomposition revisited
The decomposition of graphs by clique-minimal separators is a common algorithmic tool, first introduced by Tarjan. Since it allows to cut a graph into smaller pieces, it can be applied to preprocess the graphs in the computation of many optimization problems. However, the best known clique-decomposition algorithms have respective O(nm)-time and O(n)-time complexity, that is prohibitive for larg...
متن کاملNew Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem
Graph decompositions such as decomposition by clique separators and modular decomposition are of crucial importance for designing efficient graph algorithms. Clique separators in graphs were used by Tarjan as a divide-and-conquer approach for solving various problems such as the Maximum Weight Stable Set (MWS) problem, Colouring and Minimum Fill-in. The basic tool is a decomposition tree of the...
متن کاملDecomposition by maxclique separators
We provide a minimal counterexample to the correctness of an algorithm proposed by R. Tarjan for decomposing a graph by maximal clique separators. We also suggest a modification to that algorithm which not only corrects it but also retains its O(nm) time complexity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011